Exponential Inequalities for Empirical Unbounded Context Trees
نویسنده
چکیده
Abstract. In this paper we obtain exponential upper bounds for the rate of convergence of a version of the algorithm Context, when the underlying tree is not necessarily bounded. The algorithm Context is a well-known tool to estimate the context tree of a Variable Length Markov Chain. As a consequence of the exponential bounds we obtain a strong consistency result. We generalize in this way several previous results in the field.
منابع مشابه
Rate of convergence of penalized likelihood context tree estimators
The Bayesian Information Criterion (BIC) was first proposed by Schwarz (1978) as a model selection technique. It was thought that BIC was not appropriate for the case of context tree estimation, because of the huge number of trees that has to be tested. Recently, Csiszár & Talata (2006) proved the almost surely consistency of the BIC estimator and they also showed that it can be computed in lin...
متن کاملSharp Singular Adams Inequalities in High Order Sobolev Spaces
In this paper, we prove a version of weighted inequalities of exponential type for fractional integrals with sharp constants in any domain of finite measure in R. Using this we prove a sharp singular Adams inequality in high order Sobolev spaces in bounded domain at critical case. Then we prove sharp singular Adams inequalities for high order derivatives on unbounded domains. Our results extend...
متن کاملExponential Inequalities for Vlmc Empirical Trees ∗
A seminal paper by Rissanen, published in 1983, introduced the class of Variable Length Markov Chains and the algorithm Context which estimates the probabilistic tree generating the chain. Even if the subject was recently considered in several papers, the central question of the rate of convergence of the algorithm remained open. This is the question we address here. We provide an exponential u...
متن کاملExponential inequalities for unbounded functions of geometrically ergodic Markov chains. Applications to quantitative error bounds for regenerative Metropolis algorithms
The aim of this note is to investigate the concentration properties of unbounded functions of geometrically ergodic Markov chains. We derive concentration properties of centered functions with respect to the square of Lyapunov’s function in the drift condition satisfied by the Markov chain. We apply the new exponential inequalities to derive confidence intervals for MCMC algorithms. Quantitativ...
متن کاملHitting Times, Functional Inequalities, Lyapunov Conditions and Uniform Ergodicity
The use of Lyapunov conditions for proving functional inequalities was initiated in [5]. It was shown in [4, 30] that there is an equivalence between a Poincaré inequality, the existence of some Lyapunov function and the exponential integrability of hitting times. In the present paper, we close the scheme of the interplay between Lyapunov conditions and functional inequalities by • showing that...
متن کامل